Weighted Complete Graphs for Condensing Data
نویسندگان
چکیده
منابع مشابه
META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملMonotonicity for Complete Graphs and Symmetric Complete Bipartite Graphs
Given a graph G, let fk be the number of forests of cardinality k in G. Then the sequence (fk) has been conjectured to be unimodal for any graph G. In this paper we confirm this conjecture for Kn and Kn,n by showing that the sequence for Kn is strictly increasing (when n ≥ 4) and the sequence for Kn,n is strictly increasing except for the very last term. As a corollary we also confirm the conje...
متن کاملComplete Convergence and Some Maximal Inequalities for Weighted Sums of Random Variables
Let be a sequence of arbitrary random variables with and , for every and be an array of real numbers. We will obtain two maximal inequalities for partial sums and weighted sums of random variables and also, we will prove complete convergence for weighted sums , under some conditions on and sequence .
متن کاملAttachment Centrality for Weighted Graphs
Measuring how central nodes are in terms of connecting a network has recently received increasing attention in the literature. While a few dedicated centrality measures have been proposed, Skibski et al. [2016] showed that the Attachment Centrality is the only one that satisfies certain natural axioms desirable for connectivity. Unfortunately, the Attachment Centrality is defined only for unwei...
متن کاملThe weighted independent domination problem is NP-complete for chordal graphs
The concept of domination in graph theory is a natural model for many location problems in operations research. In a graph G = (V, E), a dominating set is a subset D of V such that every vertex not in D is adjacent to at least one vertex in D. The domination problem is to determine, for a graph G and a positive integer k, if G has a dominating set of size at most k. Domination and its variation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2020
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2020.10.005